Preserving nearest neighbor consistency in cluster analysis
نویسندگان
چکیده
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix CHAPTER
منابع مشابه
Asymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کاملConvergence Rate of the Fuzzy Generalized Nearest Neighbor Rule
tizzy k nearest neighbor rule (k-NNR) has been applied in a variety of substantive areas. Yang and Chen [l] described a fuzzy generalized k-NN algorithm which is a unified approach to a variety of fuzzy k-NNR’s. They created the strong consistency of posterior risk of the fuzzy generalized NNR. In this paper, we give their convergence rate. That is, the convergence rate of posterior risk of the...
متن کاملConsistency of Nearest Neighbor Methods
In this lecture we return to the study of consistency properties of learning algorithms, where we will be interested in the question of whether the generalization error of the function learned by an algorithm approaches the Bayes error in the limit of infinite data. In particular, we will consider consistency properties of the simple k-nearest neighbor (k-NN) classification algorithm (in the ne...
متن کاملDimension Reduction
The “curse of dimensionality” refers to various phenomena that arise when analyzing and organizing data in high dimensions. For example, the solution to nearest neighbor problem grows exponentially with the dimension. Therefore dimension reduction, the process of representing data in lower dimensions while preserving the essential properties, is very useful. Common techniques include Singular V...
متن کاملAn algorithm for `1 nearest neighbor search via monotonic embedding
Fast algorithms for nearest neighbor (NN) search have in large part focused on `2 distance. Here we develop an approach for `1 distance that begins with an explicit and exactly distance-preserving embedding of the points into `2. We show how this can efficiently be combined with random-projection based methods for `2 NN search, such as locality-sensitive hashing (LSH) or random projection trees...
متن کامل